Data structures

Results: 1048



#Item
91Brief Announcement: Tree Decomposition for Faster Concurrent Data Structures Johannes Schneider Roger Wattenhofer

Brief Announcement: Tree Decomposition for Faster Concurrent Data Structures Johannes Schneider Roger Wattenhofer

Add to Reading List

Source URL: disco.ethz.ch

- Date: 2014-09-26 08:36:48
    92Algorithms and Data Structures (WS15/16) Example Solutions for Unit 7 Question 1 We will use here the following fact that was mentioned in class: Polynomial division can be done in O(n log n).

    Algorithms and Data Structures (WS15/16) Example Solutions for Unit 7 Question 1 We will use here the following fact that was mentioned in class: Polynomial division can be done in O(n log n).

    Add to Reading List

    Source URL: www-tcs.cs.uni-sb.de

    - Date: 2016-03-04 12:57:33
      93LVars: Lattice-based Data Structures for Deterministic Parallelism Lindsey Kuper Ryan R. Newton

      LVars: Lattice-based Data Structures for Deterministic Parallelism Lindsey Kuper Ryan R. Newton

      Add to Reading List

      Source URL: www.cs.indiana.edu

      - Date: 2013-07-29 11:00:39
        94Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

        Algorithms and Data Structures Winter TermExercises for UnitConsider a bipartite graph G = (A ∪ B, E). • Let M1 and M2 be two matchings in G. Show that there is always a matching that

        Add to Reading List

        Source URL: www-tcs.cs.uni-sb.de

        - Date: 2016-03-20 15:51:33
          95The Memory Behavior of Data Structures in C SPEC CPU2000 Benchmarks Kartik K. Agaram Stephen W. Keckler Calvin Lin Kathryn S. McKinley Department of Computer Sciences

          The Memory Behavior of Data Structures in C SPEC CPU2000 Benchmarks Kartik K. Agaram Stephen W. Keckler Calvin Lin Kathryn S. McKinley Department of Computer Sciences

          Add to Reading List

          Source URL: akkartik.name

          - Date: 2006-01-25 23:07:21
            96HIPPARCHUS DATA STRUCTURES: POINTS, LINES AND REGIONS IN SPHERICAL VORONOI GRID Hrvoje Lukatela 2320 Oxbridge Drive, Calgary, AB T2N 3Z6 CANADA (Envoy 100: lukatela)

            HIPPARCHUS DATA STRUCTURES: POINTS, LINES AND REGIONS IN SPHERICAL VORONOI GRID Hrvoje Lukatela 2320 Oxbridge Drive, Calgary, AB T2N 3Z6 CANADA (Envoy 100: lukatela)

            Add to Reading List

            Source URL: mapcontext.com

            - Date: 2008-08-30 00:45:07
              97DATA STRUCTURES AND ALGORITHMS FOR RASTER DATA PROCESSING Albert L. Zobrist Jet Propulsion Laboratory California Institute of Technology

              DATA STRUCTURES AND ALGORITHMS FOR RASTER DATA PROCESSING Albert L. Zobrist Jet Propulsion Laboratory California Institute of Technology

              Add to Reading List

              Source URL: mapcontext.com

              - Date: 2008-08-29 23:28:40
                98Peer-Grading in a Course on Algorithms and Data Structures Machine Learning Algorithms do not Improve over Simple Baselines Learning @ Scale

                Peer-Grading in a Course on Algorithms and Data Structures Machine Learning Algorithms do not Improve over Simple Baselines Learning @ Scale

                Add to Reading List

                Source URL: learningatscale.acm.org

                - Date: 2016-05-20 11:56:42
                  99MICHAEL CYSOUW (Leipzig) Using the World Atlas of Language Structures The World Atlas of Language Structures is a recently published resource providing data on the geographical distribution of grammatical structures for

                  MICHAEL CYSOUW (Leipzig) Using the World Atlas of Language Structures The World Atlas of Language Structures is a recently published resource providing data on the geographical distribution of grammatical structures for

                  Add to Reading List

                  Source URL: cysouw.de

                  - Date: 2014-01-15 15:16:41
                    100Application Note | AN109 Ultra-Fast xBTI Reliability Tests with ProChek™ Introduction This application note addresses how ProChek can serve to gather bias temperature instability (BTI) data from test structures that ar

                    Application Note | AN109 Ultra-Fast xBTI Reliability Tests with ProChek™ Introduction This application note addresses how ProChek can serve to gather bias temperature instability (BTI) data from test structures that ar

                    Add to Reading List

                    Source URL: www.ridgetopgroup.com

                    - Date: 2015-07-18 01:30:08